ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS
نویسندگان
چکیده
منابع مشابه
Product version of reciprocal degree distance of composite graphs
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملSome results on the reciprocal sum-degree distance of graphs
In this contribution, we first investigate sharp bounds for the reciprocal sum-degree distance of graphs with a given matching number. The corresponding extremal graphs are characterized completely. Then we explore the k-decomposition for the reciprocal sum-degree distance. Finally,we establish formulas for the reciprocal sum-degree distance of join and the Cartesian product of graphs.
متن کاملon reverse degree distance of unicyclic graphs
the reverse degree distance of a connected graph $g$ is defined in discrete mathematical chemistry as [ r (g)=2(n-1)md-sum_{uin v(g)}d_g(u)d_g(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $g$, respectively, $d_g(u)$ is the degree of vertex $u$, $d_g(u)$ is the sum of distance between vertex $u$ and all other vertices of $g$, and $v(g)$ is the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 2011
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972711002711